A simultaneous triangularization result
نویسندگان
چکیده
منابع مشابه
On Invertibility Preserving Linear Mappings, Simultaneous Triangularization and Property L
1. Introduction. The investigation leading to this publication was motivated by a desire to try to understand the structure of a linear unital mapping ϕ from a unital algebra A of matrices contained in M h (C) into M n (C) which has the property that an invertible element in A is mapped into an invertible in M n (C). The interest in this question was raised by some earlier results on a linear i...
متن کاملHouseholder triangularization of a quasimatrix
A standard algorithm for computing the QR factorization of a matrix A is Householder triangularization. Here this idea is generalized to the situation in which A is a quasimatrix, that is, a “matrix” whose “columns” are functions defined on an interval [a,b]. Applications are mentioned to quasimatrix leastsquares fitting, singular value decomposition, and determination of ranks, norms, and cond...
متن کاملApproximate Joint Matrix Triangularization
We consider the problem of approximate joint triangularization of a set of noisy jointly diagonalizable real matrices. Approximate joint triangularizers are commonly used in the estimation of the joint eigenstructure of a set of matrices, with applications in signal processing, linear algebra, and tensor decomposition. By assuming the input matrices to be perturbations of noise-free, simultaneo...
متن کاملExploiting Equitable Partitions for Efficient Block Triangularization
In graph theory a partition of the vertex set of a graph is called equitable if for all pairs of cells all vertices in one cell have an equal number of neighbours in the other cell. Considering the implications for the adjacency matrix one may generalize that concept as a block partition of a complex square matrix s.t. each block has constant row sum. It is well known that replacing each block ...
متن کاملReliable numerical methods for polynomial matrix triangularization
Numerical procedures are proposed for triangularizing polynomial matrices over the eld of polynomial fractions and over the ring of polynomials. They are based on two standard polynomial techniques: Sylvester matrices and interpolation. In contrast to other triangularization methods, the algorithms described in this paper only rely on well-worked numerically reliable tools. They can also be use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2016
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.09.044